Reconfiguration in bounded bandwidth and treedepth
نویسنده
چکیده
We show that several reconfiguration problems known to be PSPACE-complete remain so even when limited to graphs of bounded bandwidth. The essential step is noticing the similarity to very limited string rewriting systems, whose ability to directly simulate Turing Machines is classically known. This resolves a question posed open in [Bonsma P., 2012]. On the other hand, we show that a large class of reconfiguration problems becomes tractable on graphs of bounded treedepth, and that this result is in some sense tight.
منابع مشابه
Treedepth Bounds in Linear Colorings
Low-treedepth colorings are an important tool for algorithms that exploit structure in classes of bounded expansion; they guarantee subgraphs that use few colors are guaranteed to have bounded treedepth. These colorings have an implicit tradeoff between the total number of colors used and the treedepth bound, and prior empirical work suggests that the former dominates the run time of existing a...
متن کاملA Polynomial Excluded-Minor Approximation of Treedepth
Treedepth is a well-studied graph invariant in the family of “width measures” that includes treewidth and pathwidth. Understanding these invariants in terms of excluded minors has been an active area of research. The recent Grid Minor Theorem of Chekuri and Chuzhoy [12] establishes that treewidth is polynomially approximated by the largest k×k grid minor. In this paper, we give a similar polyno...
متن کاملOpen problems from Workshop on Kernels
Treedepth-d modulator as a parameter Somnath Sikdar The recent kernelization algorithms in very general sparse graph classes such as graphs of bounded expansion use the structural parameter of a constant-treedepth modulator [1]. The parameter seems natural in these graph classes, but we have not yet investigated its full power also in general graphs. What natural problems admit a polynomial ker...
متن کاملWidth, depth and space
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted than graphs of bounded treeor pathwidth, we are interested in the algorithmic utility of this additional structure. On the negative side, we show with a novel...
متن کاملHow Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?
In the last years, kernelization with structural parameters has been an active area of research within the field of parameterized complexity. As a relevant example, Gajarskỳ et al. [ESA 2013] proved that every graph problem satisfying a property called finite integer index admits a linear kernel on graphs of bounded expansion and an almost linear kernel on nowhere dense graphs, parameterized by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 93 شماره
صفحات -
تاریخ انتشار 2018